In view of the problems that the spatial distribution of traffic model in traditional Network on Chip (NoC) was not consistent with the communication locality in practical applications and the overhead of network bandwidth is large, a novel algorithm for flow generation with NoC localized characteristic based on Rent rule was proposed. By establishing the communication probability distribution model with finite Mesh structure, the communication probability matrix was used to send packets to each node uniformly and obtain synthesis flows, and the locality was realized. The experiment simulated on flow with different locality degree and different network size. The results show that the proposed algorithm has better performance in flow locality, which is more close to the actual flows compared with five algorithms including Random Uniform, Bit Complement, Reversal, Transpose and Butterfly. In addition, the overhead of network bandwidth is lower.

Since fuzzy rough sets induced by fuzzy equivalence relations can not quite accurately reflect decision problems described by numerical attributes among fuzzy concept domain, a fuzzy rough set model based on neighborhood relation called NR-FRS was proposed. First of all, the definitions of the rough set model were presented. Based on properties of NR-FRS, a fuzzy neighborhood approximation space reasoning was carried out, and attribute dependency in characteristic subspace was also analyzed. Finally, feature selection algorithm based on NR-FRS was presented, and feature subsets was constructed next, which made fuzzy positive region greater than a specific threshold, thereby getting rid of redundant features and reserving attributes that have a strong capability in classification. Classification experiment was implemented on UCI standard data sets, which used Radial Basis Function (RBF) support vector machine as the classifier. The experimental results show that, compared with fast forward feature selection based on neighborhood rough set as well as Kernel Principal Component Analysis (KPCA), feature number of the subset obtained by NR-FRS model feature selection algorithm changes more smoothly and stably according to parameters. Meanwhile, average classification accuracy increases by 5.2% in the best case and varies stably according to parameters.

To solve the congestion problem at node in delay tolerant networks, an active congestion control strategy based on historical probability was proposed. The strategy put forward the concept of referenced probability that could be adjusted dynamically by the degree of congestion. Referenced probability would control the forwarding conditions to avoid and control the congestion at node. At the same time the utilization of idle resources and the transmission efficiency of the network would be promoted. The simulation results show that the strategy upgrades delivery ratio of the entire network and reduces the load ratio and message loss rate. As a result, the active congestion control is realized and the transmission performance of the network is enhanced.

To facilitate the communication between remote and adjacent nodes on the large-scale Networks-on-Chip (NoC), a hierarchical Cluster-like Hierarchical Mesh (CHM) topology based on region partition was proposed. Correspondingly, to avoid performance degradation due to the bad network congestion near the intermediate nodes, an adaptive source region path selection algorithm was elaborated. According to the region characteristic in CHM, the routing decision was determined in the source region instead of source node only, and the adaptive routing node pair was distinguished among bottom and upper node pairs, which enhanced the routing selection performance for those node pairs, so as to alleviate the bad network congestion. The experimental results show that, compared with the shortest path algorithm, the proposed algorithm can increase saturation injection by at most 51% and 31% respectively under synthetic and local traffic patterns, showing an effective improvement in network throughput.

Center extraction is a primary stage in the extraction of Placido image. Therefore, a curve fitting method is proposed to detect the center. Firstly, Hough transform was used to locate the approximate center, and Placido image was located in the polar coordinate. Then the Gaussian kernel function was convolved with the image, and the points were detected in the polaraxis. Finally, based on the coordinates of these points, the accurate center was obtained by the ellipse fitting method. The precision can be brought to the order of sub-pixels by this algorithm and the mean error of diopter is less than 0.25D. Extracting results show that proposed method has higher accuracy and better robustness and provides guarantee on the precise corneal topography.

Based on the linear quadtree, an image-element coding method oriented to image pyramid was introduced. According to the coding rules and Bounding BOX (BBOX) recurrence formula, the corresponding feature, location feature, existence feature and neighborhood feature were analyzed. Furthermore, a global multi-resolution virtual terrain environment and zoom-in operation algorithm were constructed to test the coding method. The results show that the method can distinguish boundary image-element and neighborhood image-element rapidly, and has a higher rate than other similar algorithms.

With the application of mobile agent technology in distributed computing, mobile agent systems encounter numerous security and software engineering challenges. To prevent malicious or unauthorized attacks from the third party entities, the method of protection of agent’s data and code was investigated, and a new mobile agent’s architecture was designed, which was composed of data wrapping all executable code intended for a given platform and explicit agent code in charge of transporting and handling the above data. The data-code split could co-exist with other architectures already proposed to improve platform interoperability. Finally, to protect data from agent’s code modification, public key decryption mechanism and agent authentication mechanism was analyzed. To protect code from injection of malicious data, data protection mechanism was proposed by improving the structure of data.

Based on component technology, a method of OWL-based Web service was proposed. Combined with atom-component and ontology, the Web service component granularity became a single function component. The application of OWL and ontology improved Web service at information and knowledge.